// Copyright 2013 Google Inc. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//   http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

#ifndef MAX_FLOW_H_
#define MAX_FLOW_H_

#include "compat.h"

// TODO replace this with an open source max flow implementation.

namespace max_flow {

typedef int NodeIndex;
typedef int ArcIndex;
typedef long long FlowQuantity;

class SimpleMaxFlow {
 public:
  ArcIndex AddArcWithCapacity(
        NodeIndex tail, NodeIndex head, FlowQuantity capacity) {
    CHECK(false);
    return 0;
  }

  void GetSinkSideMinCut(vector<NodeIndex>* result) {
    CHECK(false);
  }

  enum Status {
    OPTIMAL
  };

  Status Solve(NodeIndex source, NodeIndex sink) {
    CHECK(false);
    return OPTIMAL;
  }
};

}  // namespace max_flow

#endif  // MAX_FLOW_H_
